Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
نویسندگان
چکیده
Lot-Sizing Problems Kerem Akartunalı Dept. of Management Science, University of Strathclyde, Glasgow, G1 1QE, UK, [email protected] Ioannis Fragkos Management Science & Innovation, University College London, London WC1E 6BT, UK, [email protected] Andrew J. Miller Advanced Analytics Manager, UPS, 30328 Atlanta, GA, USA, [email protected] Tao Wu Advanced Analytics Department, Dow Chemical, 48642 Midland, MI, USA, [email protected]
منابع مشابه
A big bucket time indexed formulation for nonpreemptive single machine scheduling problems
A big bucket time indexed mixed integer linear programming formulation for nonpreemptive single machine scheduling problems is presented in which the length of each period can be as large as the processing time of the shortest job. The model generalises the classical time indexed model to one in which at most two jobs can be processing in each period. The two models are equivalent in the case t...
متن کاملSome Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints
The authors also gratefully acknowledge the detailed comments of two anonymous referees regarding relationships with lot-sizing problems. ii Abstract This paper studies the polyhedral structure of dynamic fixed-charge problems that have nested relationships constraining the flow or activity variables. Constraints of this type might typically arise in hierarchical or multi-period models, but mig...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملErratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملLot-sizing with stock upper bounds and fixed charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2016